Performance Comparison of Main-Memory Algorithms for Set Containment Joins
نویسنده
چکیده
We evaluate and compare performance of signature nested loops, set partitioning, and inverted lists algorithms for set containment joins. We study running time and required storage space for the algorithms depending on such characteristics of input data sets as number of records, average cardinality of the set-valued attribute, and cardinality of the set elements domain. We outline implementation details of the algorithms and present experimental results obtained on our research database kernel Memphis.
منابع مشابه
Partitioning Inverted Lists for Efficient Evaluation of Set-Containment Joins in Main Memory
We present an algorithm for efficient processing of set-containment joins in main memory. Our algorithm uses an index structure based on inverted files. We focus on improving performance of the algorithm in a main-memory environment by utilizing the L2 CPU cache more efficiently. To achieve this, we employ some optimizations including partitioning the inverted lists and compressing the intermed...
متن کاملDivide-and-Conquer Algorithm for Computing Set Containment Joins
A set containment join is a join between set-valued attributes of two relations, whose join condition is speci ed using the subset ( ) operator. Set containment joins are used in a variety of database applications. In this paper, we propose a novel partitioning algorithm called Divide-and-Conquer Set Join (DCJ) for computing set containment joins eÆciently. We show that the divide-and-conquer a...
متن کاملEvaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates
Current data models like the NF2 model and object-oriented models support setvalued attributes. Hence, it becomes possible to have join predicates based on set comparison. This paper introduces and evaluates several main memory algorithms to evaluate e ciently this kind of join. More speci cally, we concentrate on the set equality and the subset predicates.
متن کاملSet Containment Joins: The Good, The Bad and The Ugly
EÆcient support for set-valued attributes is likely to grow in importance as object-relational database systems, which either support set-valued attributes or propose to do so soon, begin to replace their purely relational predecessors. One of the most interesting and challenging operations on set-valued attributes is the set containment join, because it provides a concise and elegant way to ex...
متن کاملEvaluation of Main Memory Join Algorithms for Joins with Subset Join Predicates
Current data models like the NF2 model and object,-oriented models support set-valued at.t,ribut,t:s. Hence, it, becomes possible to havt> join prcdica.tes ba.sed on set, comparison. This paper int,roduces and evaluates two main memory algorithms to evaluate efficiently this kind of join. More specifically, we concentrate on subset predicates.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004